منابع مشابه
On Conditional Decomposability
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verification whether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to exte...
متن کاملOn Decomposability of Multilinear Sets
We consider the Multilinear set S defined as the set of binary points (x, y) satisfying a collection of multilinear equations of the form yI = ∏ i∈I xi, I ∈ I, where I denotes a family of subsets of {1, . . . , n} of cardinality at least two. Such sets appear in factorable reformulations of many types of nonconvex optimization problems, including binary polynomial optimization. A great simplifi...
متن کاملOn Decomposability and Interaction Functions
A formal notion of a Boolean-function decomposition was introduced recently and used to provide lower bounds on various representations of Boolean functions, which are subsets of decomposable negation normal form (DNNF). This notion has introduced a fundamental optimization problem for DNNF representations, which calls for computing decompositions of minimal size for a given partition of the fu...
متن کاملOn the Effective Jordan Decomposability
The classical Jordan decomposition Theorem says that any real function of bounded variation can be expressed as a difference of two increasing functions. This paper explores the effective version of Jordan decomposition. We give a sufficient and necessary condition for those computable real functions of bounded variation which can be expressed as a difference of two computable increasing functi...
متن کاملOn decomposability in logical calculi
In the paper, a natural class of logical calculi is fixed for which we formulate the notion of a ∆–decomposable set of formulas. We demonstrate that the property of uniqueness of signature decompositions holds in those calculi of this class that have the Craig interpolation property. In conclusion, we give a sufficient condition for the ∆–decomposability property to be decidable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2012
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2012.07.013